On Realizability and Dynamic Reconfiguration of Choreographies

Choreography description languages aim at specifying from a global point of view interactions among a set of services involved in a new system. From this specification, local implementations or peers can be automatically generated. Generation of peers that precisely implement the choreography specification is not always possible: this problem is known as realizability. When peers corresponding to this specification are being executed we may want to modify the choreography specification and reconfigure dynamically the system. This is the case for instance if we add or remove interactions due to the addition of functionalities to the system at hand or the loss of a service. In this paper, we first present the Chor specification language, and successively present our solutions to check if a choreography is realizable and if a specific reconfiguration can be applied or not.